Multidimensional Information Encryption and Storage: When the Input Is Light
نویسندگان
چکیده
منابع مشابه
When Is Multidimensional Screening a Convex
A principal wishes to transact business with a multidimensional distribution of agents whose preferences are known only in the aggregate. Assuming a twist (= generalized Spence-Mirrlees single-crossing) hypothesis, quasi-linear utilities, and that agents can choose only pure strategies, we identify a structural condition on the value b(x, y) of product type y to agent type x — and on the princi...
متن کاملon the relationship between different discourse markers and information-gap and reasoning-gap tasks, and the effectiveness of input enhancement type of instruction on students acquisition of discourse markers.
abstract tasks nowadays are at the center of attention in sla research. task types is one of the critical issues in this regard, their effectiveness and suitability to any particular context, their characteristics and the result they yield are among some of these issues. on the other hand, discourse markers (dms) have been very much investigated and their effectiveness in conveying the meaning...
15 صفحه اولLow-Latency Encryption - Is "Lightweight = Light + Wait"?
The processing time required by a cryptographic primitive implemented in hardware is an important metric for its performance but it has not received much attention in recent publications on lightweight cryptography. Nevertheless, there are important applications for cost effective low-latency encryption. As the first step in the field, this paper explores the lowlatency behavior of hardware imp...
متن کاملMulti-input Functional Encryption
Functional encryption (FE) is a powerful primitive enabling fine-grained access to encrypted data. In an FE scheme, secret keys (“tokens”) correspond to functions; a user in possession of a ciphertext ct = Enc(x) and a token TKf for the function f can compute f(x) but learn nothing else about x. An active area of research over the past few years has focused on the development of ever more expre...
متن کاملWhen every $P$-flat ideal is flat
In this paper, we study the class of rings in which every $P$-flat ideal is flat and which will be called $PFF$-rings. In particular, Von Neumann regular rings, hereditary rings, semi-hereditary ring, PID and arithmetical rings are examples of $PFF$-rings. In the context domain, this notion coincide with Pr"{u}fer domain. We provide necessary and sufficient conditions for...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Research
سال: 2021
ISSN: 2639-5274
DOI: 10.34133/2021/7897849